On 3-total edge product cordial labeling of honeycomb
نویسندگان
چکیده
منابع مشابه
On k-total edge product cordial graphs
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting a 2total edge product cordial labeling. We also show that dense graphs and regular graphs of degree 2(k − 1) admit a k-total edge product cordial labeling.
متن کاملFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
متن کاملProduct Cordial Labeling for Some New Graphs
Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...
متن کامل$4$-Total prime cordial labeling of some cycle related graphs
Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...
متن کاملOn k-cordial labeling
Hovey [Discrete Math. 93 (1991), 183–194] introduced simultaneous generalizations of harmonious and cordial labellings. He defines a graph G of vertex set V (G) and edge set E(G) to be k-cordial if there is a vertex labelling f from V (G) to Zk, the group of integers modulo k, so that when each edge xy is assigned the label (f(x) + f(y)) (mod k), the number of vertices (respectively, edges) lab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2017
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2017.02.002